package com.xf.leecode.linked;

import com.xf.leecode.bean.linked.Node;

/**
 * @author zouxf Department:3cs
 * @date 2022/10/18 16:21
 * @description
 * @see
 */
public class ReverseByGroup {
    public static void main(String[] args) {
        Node node = createNode();
        System.out.println(node);
    }



    static Node reverseNode(Node node,Integer n) {

        return node;
    }

    static Node createNode() {
        Node<String> node = new Node<>(null,"1",null);
        Node<String> curr = node;
        for (int i = 2; i < 10; i++) {
            Node<String> next = new Node<>(curr, i+"", null);
            curr.next = next;
            curr = next;
        }
        return node;
    }
}
